Reducing cross domain call overhead using batched futures
نویسندگان
چکیده
منابع مشابه
Reducing Procedure Call Overhead: Optimizing Register Usage at Procedure Calls
This paper proposes a common global variable reassignment and an integrated approach which takes advantage of the complementary relationship of inlining and interprocedural register allocation to reduce the procedure call overhead without causing additional negative effect. Our approach is based on the observation of analyzed program characteristic t o identify the heavy called procedures regio...
متن کاملReducing the Adaptation Overhead
Déjà Vu is a case-based software design system whose success is based on two novel techniques: hierarchical case-based reasoning and adaptation-guided retrieval. Hierarchical case-based reasoning (HCBR) solves complex problems in a hierarchical fashion by reusing and combining the solutions of many separate cases and is fully supported by the normal CBR retrieve-and-adapt cycle. Adaptation-guid...
متن کاملOn Reducing Overhead in Loops
In this paper we discuss several techniques for reducing the overhead in Fortran-like DO loops. In particular, we describe two topics: 1. Simplifying loop bounds. 2. Removing a ne IF-statements from loops. The objective is to isolate the part of the iteration space of the original loop in which the bounds take simpler forms, or in which the condition is satis ed. The main technical tool for det...
متن کاملReducing FPGA Reconfiguration Time Overhead using Virtual Configurations
Reconfiguration time overhead is a critical factor in determining the system performance of FPGA dynamically reconfigurable designs. To reduce the reconfiguration overhead, the most straightforward way is to increase the reconfiguration throughput, as many previous contributions did. In addition to shortening FPGA reconfiguration time, we introduce a new concept of Virtual ConFigurations (VCF) ...
متن کاملReducing Data Communication Overhead for Doacross Loop Nests Reducing Data Communication Overhead for Doacross Loop Nests
If the loop iterations of a loop nest cannot be partitioned into independent sets, the data communication for data dependences are inevitable in order to execute them on parallel machines. This kind of loop nests are referred to as Doacross loop nests. This paper is concerned with compiler algorithms for parallelizing Doacross loop nests for distributed-memory multicomputers. We present a metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 1994
ISSN: 0362-1340,1558-1160
DOI: 10.1145/191081.191133